Authentication Protocols making use of Context free Grammar: Guessing Strings

نویسندگان

  • Abhishek Singh
  • David Dagon
چکیده

Until now context free grammars (CFG) have been used mainly for the design of programming languages. There have been several studies, which demonstrate the relationship between learning theory and number theory. This paper presents protocols, which use context free languages for an authentication protocol using one-time authentication information. This authentication information can be used for the generation of one-time passwords. This paper also analyses of the difficulty of guessing strings in such a language. The paper further discusses structured and unstructured techniques for generating strings, which is a part of ongoing work. We present here our approach and some of our early results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Context Free Grammar for the Generation of One Time Authentication Identity

An authentication protocol was proposed in [11] for the generation of one time authentication identity, which can be used as one time passwords, generation of disposal credit card numbers. The proposed protocol was designed using a context free grammar and was in the learning theory domain. The protocol required that the context free grammar used for the authentication procedure be difficult to...

متن کامل

Formalizing some combinatorial attacks in security protocols

Context. Security protocols are distributed programs that aim at ensuring security properties, such as confidentiality, authentication or anonymity, by the means of cryptography. Such protocols are widely deployed, e.g., for electronic commerce on the Internet, in banking networks, mobile phones and more recently electronic elections. As properties need to be ensured, even if the protocol is ex...

متن کامل

Fast, Lean, and Accurate: Modeling Password Guessability Using Neural Networks

Human-chosen text passwords, today’s dominant form of authentication, are vulnerable to guessing attacks. Unfortunately, existing approaches for evaluating password strength by modeling adversarial password guessing are either inaccurate or orders of magnitude too large and too slow for real-time, client-side password checking. We propose using artificial neural networks to model text passwords...

متن کامل

Optimal authentication protocols resistant to password guessing attacks

Users are typically authenticated by their passwords. Because people are known to choose convenient passwords, which tend to be easy to guess, authenti-cation protocols have been developed that protect user passwords from guessing attacks. These proposed protocols , however, use more messages and rounds than those protocols that are not resistant to guessing attacks. This paper gives new protoc...

متن کامل

The Guessing Game : A Paradigm for Arti cial Grammar

In a guessing game, Ss reconstruct a sequence by guessing each successive element of the sequence from a nite set of alternatives, receiving feedback after each guess. An upper bound on Ss knowledge of the sequence is given by ^ H, the estimated entropy of the numbers of guesses. The method provides a measure of learning independent of material type and distractors, and the resulting data set i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004